dynamic scope - définition. Qu'est-ce que dynamic scope
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est dynamic scope - définition

REGION OF A COMPUTER PROGRAM WHERE A NAME BINDING IS VALID
Static scoping; Dynamic scoping; Dynamic variable scoping; Dynamic scope; Lexical variable scoping; Lexical scoping; Lexical environment; Static scope; Shallow binding; Lexically scoped; Variable scoping; Lexical scope; Global Methods; Scoping; Dynamically scoped; Lexically-scoped; Lexicographical scope; Lexicographical scoping; Lexicographic scoping; Lexicographic scope; Scope (programming); Scope (computer programming); Global scope; Let-expression; Function scope; Block scope; Block scoping; Function scoping; File scope; Module scope; Rules of scope; Scoping rules; Scope rules; Scoping rule; Lexical variable scope; Scope block; Scope (computing); Comparison of programming languages (scope)

dynamic scope         
<language> In a dynamically scoped language, e.g. most versions of Lisp, an identifier can be referred to, not only in the block where it is declared, but also in any function or procedure called from within that block, even if the called procedure is declared outside the block. This can be implemented as a simple stack of (identifier, value) pairs, accessed by searching down from the top of stack for the most recent instance of a given identifier. The opposite is lexical scope. A common implementation of dynamic scope is shallow binding. (1996-07-11)
dynamic scoping         
dynamically scoped         

Wikipédia

Scope (computer science)

In computer programming, the scope of a name binding (an association of a name to an entity, such as a variable) is the part of a program where the name binding is valid; that is, where the name can be used to refer to the entity. In other parts of the program, the name may refer to a different entity (it may have a different binding), or to nothing at all (it may be unbound). Scope helps prevent name collisions by allowing the same name to refer to different objects – as long as the names have separate scopes. The scope of a name binding is also known as the visibility of an entity, particularly in older or more technical literature—this is from the perspective of the referenced entity, not the referencing name.

The term "scope" is also used to refer to the set of all name bindings that are valid within a part of a program or at a given point in a program, which is more correctly referred to as context or environment.

Strictly speaking and in practice for most programming languages, "part of a program" refers to a portion of source code (area of text), and is known as lexical scope. In some languages, however, "part of a program" refers to a portion of run time (time period during execution), and is known as dynamic scope. Both of these terms are somewhat misleading—they misuse technical terms, as discussed in the definition—but the distinction itself is accurate and precise, and these are the standard respective terms. Lexical scope is the main focus of this article, with dynamic scope understood by contrast with lexical scope.

In most cases, name resolution based on lexical scope is relatively straightforward to use and to implement, as in use one can read backwards in the source code to determine to which entity a name refers, and in implementation one can maintain a list of names and contexts when compiling or interpreting a program. Difficulties arise in name masking, forward declarations, and hoisting, while considerably subtler ones arise with non-local variables, particularly in closures.